Anycasting in connection-oriented computer networks: Models, algorithms and results
نویسندگان
چکیده
منابع مشابه
Anycasting in connection-oriented computer networks: Models, algorithms and results
Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content De...
متن کاملConnection Oriented Sensor Networks
This dissertation is about sensor networks, and connection oriented communication. We present an overview of the field of sensor networks, and advocate the use of connection oriented communication technologies, such as spread spectrum radios. We claim that low duty sensor networks should use frequency synchronized radios. We additionally claim that low duty operation on a single channel is actu...
متن کاملMaximizing residual capacity in connection-oriented networks
The following problem arises in the study of survivable connection-oriented networks. Given a demandmatrix to be routed between nodes, we want to route all demands, so that the residual capacity given by the difference between link capacity and link flow is maximized. Each demand can use only one path. Therefore, the flow is modeled as nonbifurcated multicommodity flow. We call the considered p...
متن کاملInternetworking connectionless and connection-oriented networks
Malathi Veeraraghavan Mark Karol Polytechnic University Lucent Technologies 6 Metrotech Center 101 Crawfords Corner Road Brooklyn, NY 11201 Holmdel, NJ 07733 [email protected] [email protected] ABSTRACT: The use of connection-oriented (CO) networks for the transport of IP traffic is seen to have value to both users and service providers. Given the expectation that most endpoint-generated traffic will ...
متن کاملParallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarantees a deterministic quality of service to connections with real-time constraints is proposed { this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and o ers realtime performance guar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2010
ISSN: 1641-876X
DOI: 10.2478/v10006-010-0015-5